Robust Multi-Period Maximum Coverage Drone Facility Location Problem Considering Coverage Reliability
نویسندگان
چکیده
This study proposes a multi-period facility location formulation to maximize coverage while meeting reliability constraint. The constraint is chance limiting the probability of failure maintain desired service standard, commonly followed by emergency medical services and fire departments. Further, uncertainties in probabilities are incorporated utilizing robust optimization using polyhedral uncertainty sets, which results compact mixed-integer linear program. A case Portland, OR metropolitan area analyzed for employing unmanned aerial vehicles (UAVs) or drones deliver defibrillators region combat out-of-hospital cardiac arrests. In context this study, multiple periods represent with different wind speed direction distributions. show that extending formulation, rather than average information single period, particularly beneficial when either response time short not accounted for. Accounting decision-making improves significantly also reducing variability simulated coverage, especially times longer. Going from single-period deterministic boosts values 57%, on average. effect considering distance-based equity metric explored.
منابع مشابه
Capacitated Facility Location Problem with Variable Coverage Radius in Distribution System
The problem of locating distribution centers (DCs) is one of the most important issues in design of supply chain. In previous researches on this problem, each DC could supply products for all of the customers. But in many real word problems, DCs can only supply products for customers who are in a certain distance from the facility, coverage radius. Thus, in this paper a multi-objective intege...
متن کاملOn Solving General Planar Maximum Coverage Location Problem with Partial Coverage
In this paper, we introduce a new generalization of the classical planar maximum coverage location problem (PMCLP) in which demand zones and service zone of each facility are represented by two-dimensional spatial objects such as circles, polygons, etc. In addition, we allow partial coverage in the foregoing generalization, i.e., covering only part of a demand zone is allowed and the coverage a...
متن کاملPlanar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
We study the planar maximum coverage location problem (MCLP) with rectilinear distance and rectangular demand zones in the case where “partial coverage” is allowed in its true sense, i.e., when covering only part of a demand zone is allowed and the coverage accrued as a result of this is proportional to the demand of the covered part only. We pose the problem in a slightly more general form by ...
متن کاملThe Budgeted Maximum Coverage Problem
The budgeted maximum coverage problem is: given a collection S of sets with associated costs deened over a domain of weighted elements, and a budget L, nd a subset of S 0 S such that the total cost of sets in S 0 does not exceed L, and the total weight of elements covered by S 0 is maximized. This problem is NP-hard. For the special case of this problem, where each set has unit cost, a (1 ? 1 e...
متن کاملThe Maximum Facility Location Problem
In the maximum facility location problem, we are given a set of clients C and facilities F . Assigning a client u to a facility v incurs a cost w uv and each facility has an associated interval I v on the real line. Our goal is to assign as many clients to open facilities in order to maximise the cost of assignment, subject to the constraint that open facilities cannot have their respective int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Record
سال: 2022
ISSN: ['2169-4052', '0361-1981']
DOI: https://doi.org/10.1177/03611981221087240